An efficient bounded-variable nonlinear least-squares algorithm for embedded MPC

نویسندگان

چکیده

This paper presents a novel approach to solve linear and nonlinear model predictive control (MPC) problems that requires small memory footprint throughput is particularly suitable when the and/or controller parameters change at runtime. The contributions of include: (i) formulation MPC problem as bounded-variable least-squares (BVNLS) problem, demonstrating use an appropriate solver can outperform industry-standard solvers; (ii) easily-implementable library-free BVNLS with proof global convergence; (iii) matrix-free method for computing products vectors Jacobians, required by BVNLS; (iv) efficient updating sparse QR factors using active-set methods problems. Thanks explicitly parameterizing optimization algorithm in terms tuning parameters, resulting inherently immediately adaptive any changes formulation. same algorithmic framework cope linear, nonlinear, variants based on broad class prediction models sum-of-squares cost functions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounded-Variable Least-Squares: an Algorithm and Applications

The Fortran subroutine BVLS (bounded variable least-squares) solves linear least-squares problems with upper and lower bounds on the variables, using an active set strategy. The unconstrained least-squares problems for each candidate set of free variables are solved using the QR decomposition. BVLS has a “warm-start” feature permitting some of the variables to be initialized at their upper or l...

متن کامل

An Efficient Algorithm for the Separable Nonlinear Least Squares Problem

The nonlinear least squares problem miny,z‖A(y)z + b(y)‖, where A(y) is a full-rank (N + `)× N matrix, y ∈ Rn, z ∈ RN and b(y) ∈ RN+` with ` ≥ n, can be solved by first solving a reduced problem miny‖ f (y)‖ to find the optimal value y∗ of y, and then solving the resulting linear least squares problem minz‖A(y∗)z + b(y∗)‖ to find the optimal value z∗ of z. We have previously justified the use o...

متن کامل

Variable projection for nonlinear least squares problems

The variable projection algorithm of Golub and Pereyra (1973) has proven to be quite valuable in the solution of nonlinear least squares problems in which a substantial number of the parameters are linear. Its advantages are efficiency and, more importantly, a better likelihood of finding a global minimizer rather than a local one. The purpose of our work is to provide a more robust implementat...

متن کامل

Bounded Variable Least Squares – Application of a Constrained Optimization Algorithm to the Analysis of Tes Emissivity

Introduction: The objective of any linear spectral unmixing procedure is to determine the abundance at which the components represented in a predetermined end-member library are present in the observed target. This is done by modeling an observed spectrum as a linear combination of end-member spectra. Following the work of Ramsey and Christensen [1] and Feely and Christensen [2] linear unmixing...

متن کامل

Least-Squares-Based Iterative Identification Algorithm for Wiener Nonlinear Systems

This paper focuses on the identification problem ofWiener nonlinear systems.The application of the key-term separation principle provides a simplified form of the estimated parameter model. To solve the identification problem of Wiener nonlinear systems with the unmeasurable variables in the information vector, the least-squares-based iterative algorithm is presented by replacing the unmeasurab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2022

ISSN: ['1873-2836', '0005-1098']

DOI: https://doi.org/10.1016/j.automatica.2022.110293